Quick Inclusion-Exclusion
نویسندگان
چکیده
Many data mining algorithms make use of the well-known Inclusion-Exclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting measures, a quick inclusion-exclusion algorithm can be crucial for the performance. In this paper, we give an overview of several algorithms that depend on the inclusion-exclusion principle and propose an efficient algorithm to use it and evaluate its complexity. The theoretically obtained results are supported by experimental evaluation of the quick IE technique in isolation, and of an example application.
منابع مشابه
Expectations of Social Inclusion and Exclusion
Individuals engage in social interactions generally expecting inclusion (Kerr and Levine, 2008; Wesselmann et al., 2010, 2013). This expectation seems reasonable, given individuals’ basic need to establish and maintain social connections to sustain physical and psychological well-being (Baumeister and Leary, 1995). However, individuals often experience social exclusion; situations broadly invol...
متن کاملThe Inclusion-Exclusion Principle for IF-States
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...
متن کاملThe Inclusion-exclusion Principle for If-states
Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events. In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski’s inclusion-exclusion principle for probabilities on IF-events. Finally, we give some applications of this principle ...
متن کاملThe Inclusion-exclusion Principle without Distributivity
ABSTRACT. Inspired by the article of P. Grzegorzewski [The inclusion-exclusion principle for IF-events, Inform. Sci. 181 (2011), 536–546], who has worked two generalizations of the inclusion-exclusion principle for IF-events, a generalization of the inclusion-exclusion principle for mappings with values in semigroups is presented here. The main idea is in replacing the distributivity and idempo...
متن کاملSymmetric Inclusion-Exclusion
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then the formulas A(S) = ∑ T⊆S B(T ) and B(S) = ∑ T⊆S(−1) |S|−|T A(T ) are equivalent. If we replace B(S) by (−1)B(S) then these formulas take on the symmetric form A(S) = ∑ T⊆S (−1) B(T ) B(S) = ∑ T⊆S (−1) A(T ). which we call symmetric inclusion-exclusion. We study instances of symmetric inclusi...
متن کامل